Robust Timing Calibration for PET Using L1-Norm Minimization
نویسندگان
چکیده
منابع مشابه
L1-norm minimization for quaternion signals
—The l 1-norm minimization problem plays an important role in the compressed sensing (CS) theory. We present in this letter an algorithm for solving the problem of l 1 Index Terms—L-norm minimization for quaternion signals by converting it to second-order cone programming. An application example of the proposed algorithm is also given for practical guidelines of perfect recovery of quaternion s...
متن کاملRobust subspace computation using L1 norm
Linear subspace has many important applications in computer vision, such as structure from motion, motion estimation, layer extraction, object recognition, and object tracking. Singular Value Decomposition (SVD) algorithm is a standard technique to compute the subspace from the input data. The SVD algorithm, however, is sensitive to outliers as it uses L2 norm metric, and it can not handle miss...
متن کاملRobust Endmember detection using L1 norm factorization
Given this model, spectral unmixing and endmember detection are the tasks of determining the endmembers and the proportions for every data point in the scene. Several endmember detection and spectral unmixing algorithms have been developed in the literature. However, the majority of these methods do not provide an autonomous way to estimate the number of endmembers and, thus, require the number...
متن کاملcomparing congruency robust method and l1 norm minimization in micro geodesy networks
for calculation of the displacements of points in micro geodesy networks, it is essential to discover stable and unstable points. without knowing stable points, calculated displacements are due to datum deficiency. in this case, calculated displacements are not valid. there are two methods to discover stable and unstable points: a-congruency robust method b- l1 norm minimization in this study t...
متن کاملGraph Cuts via l1 Norm Minimization
Graph cuts have become an increasingly important tool for solving a number of energy minimization problems in computer vision and other fields. In this paper, the graph cut problem is reformulated as an unconstrained l1 norm minimization that can be solved effectively using interior point methods. This reformulation exposes connections between the graph cuts and other related continuous optimiz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Medical Imaging
سال: 2017
ISSN: 0278-0062,1558-254X
DOI: 10.1109/tmi.2017.2681939